QPSO-Based Adaptive DNA Computing Algorithm
نویسندگان
چکیده
منابع مشابه
QPSO-Based Adaptive DNA Computing Algorithm
DNA (deoxyribonucleic acid) computing that is a new computation model based on DNA molecules for information storage has been increasingly used for optimization and data analysis in recent years. However, DNA computing algorithm has some limitations in terms of convergence speed, adaptability, and effectiveness. In this paper, a new approach for improvement of DNA computing is proposed. This ne...
متن کاملFault Tolerant DNA Computing Based on Digital Microfluidic Biochips
Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...
متن کاملDNA Computing & Modular Algorithm
The project is based on the combination of DNA Nanomachines with DNA Origamis. The main objective is to use DNA hybridization schemes and Origamis nano-platforms to construct hierarchical sequence of Boolean operations with modular structures. Watson Crick selective pairing between nucleotides has been found robust enough to devise a new kind of molecular motors (B. Yurke et al Nature 2000 406,...
متن کاملA Symmetric Encryption Algorithm based on DNA Computing
Deoxyribo Nucleic Acid (DNA) computing is a new method of simulating the bimolecular structure of DNA and computing by means of molecular biology. DNA cryptography is a new field which has been explored worldwide. The concept of using DNA computing in the fields of cryptography and steganography has been identified as a possible technology, which may bring forward a new hope for unbreakable alg...
متن کاملAn Efficient Algorithm for Multiplication Based on Dna Computing
DNA Computing utilizes the properties of DNA for performing the computations. The computations include arithmetic and logical operations such as multiplication. We first show a procedure for multiplication of a pair of two binary numbers. The procedure mainly consist of bit-shift operation where the operation depends on bit position of one's (ignoring zero's) in the multiplicand and finally add...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2013
ISSN: 1537-744X
DOI: 10.1155/2013/160687